Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(X) → g

Q is empty.


↳ QTRS
  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(X) → g

Q is empty.

We use [27] with the following order to prove termination.

Knuth-Bendix order [24] with precedence:
trivial

and weight map:

f_1=1
g=1